Agent-based Simulation of the Pharmaceutical Parallel Trade Market: A Case Study

The pharmaceutical parallel trade market emerged as a consequence of the European single market for pharmaceuticals, involving multiple players that partake in different types of competitions. These competitions not only affect players’ profit, but also have a significant impact on European people\u27s healthcare access and welfare. Hence, modeling the pharmaceutical parallel trade market provides a way to study the market and to offer valuable decision support to authorities, people, and players involved in the market. Agent-based modeling offers a computational methodology to study macro-level outcomes emerging from individual behaviors while offering to relax conventional assumptions of standard mathematical economic models. Here, we demonstrate a use case of an agent-based model of the European pharmaceutical parallel trade market and investigate its abilities by analyzing various market scenarios

Data-driven extraction and analysis of repairable fault trees from time series data

Fault tree analysis is a probability-based technique for estimating the risk of an undesired top event, typically a system failure. Traditionally, building a fault tree requires involvement of knowledgeable experts from different fields, relevant for the system under study. Nowadays’ systems, however, integrate numerous Internet of Things (IoT) devices and are able to generate large amounts of data that can be utilized to extract fault trees that reflect the true fault-related behavior of the corresponding systems. This is especially relevant as systems typically change their behaviors during their lifetimes, rendering initial fault trees obsolete. For this reason, we are interested in extracting fault trees from data that is generated from systems during their lifetimes. We present DDFTAnb algorithm for learning fault trees of systems using time series data from observed faults, enhanced with Naïve Bayes classifiers for estimating the future fault-related behavior of the system for unobserved combinations of basic events, where the state of the top event is unknown. Our proposed algorithm extracts repairable fault trees from multinomial time series data, classifies the top event for the unseen combinations of basic events, and then uses proxel-based simulation to estimate the system’s reliability. We, furthermore, assess the sensitivity of our algorithm to different percentages of data availabilities. Results indicate DDFTAnb’s high performance for low levels of data availability, however, when there are sufficient or high amounts of data, there is no need for classifying the top event

Reliability assessment of manufacturing systems: A comprehensive overview, challenges and opportunities

Reliability assessment refers to the process of evaluating reliability of components or systems during their lifespan or prior to their implementation. In the manufacturing industry, the reliability of systems is directly linked to production efficiency, product quality, energy consumption, and other crucial performance indicators. Therefore, reliability plays a critical role in every aspect of manufacturing. In this review, we provide a comprehensive overview of the most significant advancements and trends in the assessment of manufacturing system reliability. For this, we also consider the three main facets of reliability analysis of cyber–physical systems, i.e., hardware, software, and human-related reliability. Beyond the overview of literature, we derive challenges and opportunities for reliability assessment of manufacturing systems based on the reviewed literature. Identified challenges encompass aspects like failure data availability and quality, fast-paced technological advancements, and the increasing complexity of manufacturing systems. In turn, the opportunities include the potential for integrating various assessment methods, and leveraging data to automate the assessment process and to increase accuracy of derived reliability models

A conceptual framework for holistic assessment of decision support systems for sustainable livestock farming

The livestock sector has complex relationships with the three fundamental pillars of sustainability, i.e., environmental, economic, and social. Devising a livestock farming strategy by considering the different sustainability pillars is essential. Although several decision support systems (DSSs) are available for the livestock sector, these DSSs differ in the way they address sustainability. This work emphasizes the importance of a holistic approach to sustainable livestock management rather than only targeting individual sustainability dimensions. We, therefore, propose an initial assessment framework to evaluate the capacity of livestock DSSs in targeting the different sustainability pillars. In line with this, we present a conceptual basis for deriving assessment criteria and indicators. We then use the proposed assessment framework to assess existing openly available livestock DSSs. We observe that the main focus of the existing and openly available livestock-related DSSs is on the indicators from environmental pillars, and only a few of them accommodate economic aspects. No openly available DSS includes social and governance-related points. More importantly, none of these DSSs can handle data streams from Internet of Things (IoT) devices and, hence, they miss on the superiority that advanced modelling techniques can provide. With these observations, we draft an extensive set of guidelines for future livestock-related DSSs to holistically target sustainability

A Combination of Compositional Index and Genetic Algorithm for Predicting Transmembrane Helical Segments

Transmembrane helix (TMH) topology prediction is becoming a focal problem in bioinformatics because the structure of TM proteins is difficult to determine using experimental methods. Therefore, methods that can computationally predict the topology of helical membrane proteins are highly desirable. In this paper we introduce TMHindex, a method for detecting TMH segments using only the amino acid sequence information. Each amino acid in a protein sequence is represented by a Compositional Index, which is deduced from a combination of the difference in amino acid occurrences in TMH and non-TMH segments in training protein sequences and the amino acid composition information. Furthermore, a genetic algorithm was employed to find the optimal threshold value for the separation of TMH segments from non-TMH segments. The method successfully predicted 376 out of the 378 TMH segments in a dataset consisting of 70 test protein sequences. The sensitivity and specificity for classifying each amino acid in every protein sequence in the dataset was 0.901 and 0.865, respectively. To assess the generality of TMHindex, we also tested the approach on another standard 73-protein 3D helix dataset. TMHindex correctly predicted 91.8% of proteins based on TM segments. The level of the accuracy achieved using TMHindex in comparison to other recent approaches for predicting the topology of TM proteins is a strong argument in favor of our proposed method. Availability: The datasets, software together with supplementary materials are available at: http://faculty.uaeu.ac.ae/nzaki/TMHindex.htm

Protein-protein interaction based on pairwise similarity

<p>Abstract</p> <p>Background</p> <p>Protein-protein interaction (PPI) is essential to most biological processes. Abnormal interactions may have implications in a number of neurological syndromes. Given that the association and dissociation of protein molecules is crucial, computational tools capable of effectively identifying PPI are desirable. In this paper, we propose a simple yet effective method to detect PPI based on pairwise similarity and using only the primary structure of the protein. The PPI based on Pairwise Similarity (PPI-PS) method consists of a representation of each protein sequence by a vector of pairwise similarities against large subsequences of amino acids created by a shifting window which passes over concatenated protein training sequences. Each coordinate of this vector is typically the E-value of the Smith-Waterman score. These vectors are then used to compute the kernel matrix which will be exploited in conjunction with support vector machines.</p> <p>Results</p> <p>To assess the ability of the proposed method to recognize the difference between "<it>interacted</it>" and "<it>non-interacted</it>" proteins pairs, we applied it on different datasets from the available yeast <it>saccharomyces cerevisiae </it>protein interaction. The proposed method achieved reasonable improvement over the existing state-of-the-art methods for PPI prediction.</p> <p>Conclusion</p> <p>Pairwise similarity score provides a relevant measure of similarity between protein sequences. This similarity incorporates biological knowledge about proteins and it is extremely powerful when combined with support vector machine to predict PPI.</p